<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    976. Minimum Area Rectangle
   </h1>
   <p>
    Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes.
   </p>
   <p>
    If there isn't any rectangle, return 0.
   </p>
   <p>
    &nbsp;
   </p>
   <div>
    <p>
     <strong>
      Example 1:
     </strong>
    </p>
    <pre>
<strong>Input: </strong><span id="example-input-1-1">[[1,1],[1,3],[3,1],[3,3],[2,2]]</span>
<strong>Output: </strong><span id="example-output-1">4</span>
</pre>
    <div>
     <p>
      <strong>
       Example 2:
      </strong>
     </p>
     <pre>
<strong>Input: </strong><span id="example-input-2-1">[[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]</span>
<strong>Output: </strong><span id="example-output-2">2</span>
</pre>
     <p>
      &nbsp;
     </p>
     <p>
      <strong>
       Note
      </strong>
      :
     </p>
     <ol>
      <li>
       <code>
        1 &lt;= points.length &lt;= 500
       </code>
      </li>
      <li>
       <code>
        0 &lt;=&nbsp;points[i][0] &lt;=&nbsp;40000
       </code>
      </li>
      <li>
       <code>
        0 &lt;=&nbsp;points[i][1] &lt;=&nbsp;40000
       </code>
      </li>
      <li>
       All points are distinct.
      </li>
     </ol>
    </div>
   </div>
  </div>
  <div>
   <h1 class="question_title">
    976. 最小面积矩形
   </h1>
   <p>
    给定在 xy 平面上的一组点，确定由这些点组成的矩形的最小面积，其中矩形的边平行于 x 轴和 y 轴。
   </p>
   <p>
    如果没有任何矩形，就返回 0。
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     示例 1：
    </strong>
   </p>
   <pre><strong>输入：</strong>[[1,1],[1,3],[3,1],[3,3],[2,2]]
<strong>输出：</strong>4
</pre>
   <p>
    <strong>
     示例 2：
    </strong>
   </p>
   <pre><strong>输入：</strong>[[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
<strong>输出：</strong>2
</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     提示：
    </strong>
   </p>
   <ol>
    <li>
     <code>
      1 &lt;= points.length &lt;= 500
     </code>
    </li>
    <li>
     <code>
      0 &lt;=&nbsp;points[i][0] &lt;=&nbsp;40000
     </code>
    </li>
    <li>
     <code>
      0 &lt;=&nbsp;points[i][1] &lt;=&nbsp;40000
     </code>
    </li>
    <li>
     所有的点都是不同的。
    </li>
   </ol>
  </div>
 </body>
</html>